Quasiseparable Hessenberg reduction of real diagonal plus low rank matrices and applications
نویسندگان
چکیده
منابع مشابه
A Hessenberg Reduction Algorithm for Rank Structured Matrices
In this paper we show how to perform the Hessenberg reduction of a rank structured matrix under unitary similarity operations in an efficient way, using the Givens-weight representation which we introduced in an earlier paper. This reduction can be used as a first step for eigenvalue computation. We also show how the algorithm can be modified to compute the bidiagonal reduction of a rank struct...
متن کاملA quasiseparable approach to five–diagonal CMV and companion matrices
Recent work in the characterization of structured matrices in terms of characteristic polynomials of principal submatrices is furthered in this paper. Some classical classes of matrices with quasiseparable structure include tridiagonal (related to real orthogonal polynomials) and banded matrices, unitary Hessenberg matrices (related to Szegö polynomials), and semiseparable matrices, as well as ...
متن کاملLow Rank Co-Diagonal Matrices and Ramsey Graphs
We examine n×nmatrices over Zm, with 0’s in the diagonal and nonzeros elsewhere. If m is a prime, then such matrices have large rank (i.e., n1/(p−1) − O(1) ). If m is a non-prime-power integer, then we show that their rank can be much smaller. For m = 6 we construct a matrix of rank exp(c √ log n log log n). We also show, that explicit constructions of such low rank matrices imply explicit cons...
متن کاملA Traub–like algorithm for Hessenberg-quasiseparable-Vander- monde matrices of arbitrary order
Although Gaussian elimination uses O(n) operations to invert an arbitrary matrix, matrices with a special Vandermonde structure can be inverted in only O(n) operations by the fast Traub algorithm. The original version of Traub algorithm was numerically unstable although only a minor modification of it yields a high accuracy in practice. The Traub algorithm has been extended from Vandermonde mat...
متن کاملDiagonal entry restrictions in minimum rank matrices
Let F be a field, let G be a simple graph on n vertices, and let S (G) be the class of all F -valued symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. For each graph G, there is an associated minimum rank class, M R (G) consisting of all matrices A ∈ S (G) with rankA = mr (G), the minimum rank among all matrices in S (G)....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2016
ISSN: 0024-3795
DOI: 10.1016/j.laa.2015.08.026